Computer program calculates monotonic maximum likelihood estimates using method of reversals

FORTRAN 2 computer program calculates maximum estimates of a monotonic non-decreasing response function. The program uses the method of reversals algorithm which applies to the analysis of univariate or multivariate sensitivity experiments

Effect of shear on droplets in a binary mixture

In this article we use a lattice-Boltzmann simulation to examine the effects of shear flow on a equilibrium droplet in a phase separated binary mixture. We find that large drops break up as the shear is increased but small drops dissolve. We also show how the tip-streaming, observed for deformed drops, leads to a state of dynamic equilibrium.Comment: 10 pages, LaTex, to appear in International Journal of Physics

Computer program simulates design, test, and analysis phases of sensitivity experiments

Modular program with a small main program and several specialized subroutines provides a general purpose computer program to simulate the design, test and analysis phases of sensitivity experiments. This program allows a wide range of design-response function combinations and the addition, deletion, or modification of subroutines

An economic model for evaluating high-speed aircraft designs

A Class 1 method for determining whether further development of a new aircraft design is desirable from all viewpoints is presented. For the manufacturer the model gives an estimate of the total cost of research and development from the preliminary design to the first production aircraft. Using Wright's law of production, one can derive the average cost per aircraft produced for a given break-even number. The model will also provide the airline with a good estimate of the direct and indirect operating costs. From the viewpoint of the passenger, the model proposes a tradeoff between ticket price and cruise speed. Finally all of these viewpoints are combined in a Comparative Aircraft Seat-kilometer Economic Index

Graph Laplacians and Stabilization of Vehicle Formations

Control of vehicle formations has emerged as a topic of significant interest to the controls community. In this paper, we merge tools from graph theory and control theory to derive stability criteria for formation stabilization. The interconnection between vehicles (i.e., which vehicles are sensed by other vehicles) is modeled as a graph, and the eigenvalues of the Laplacian matrix of the graph are used in stating a Nyquist-like stability criterion for vehicle formations. The location of the Laplacian eigenvalues can be correlated to the graph structure, and therefore used to identify desirable and undesirable formation interconnection topologies

Control of complex networks requires both structure and dynamics

The study of network structure has uncovered signatures of the organization of complex systems. However, there is also a need to understand how to control them; for example, identifying strategies to revert a diseased cell to a healthy state, or a mature cell to a pluripotent state. Two recent methodologies suggest that the controllability of complex systems can be predicted solely from the graph of interactions between variables, without considering their dynamics: structural controllability and minimum dominating sets. We demonstrate that such structure-only methods fail to characterize controllability when dynamics are introduced. We study Boolean network ensembles of network motifs as well as three models of biochemical regulation: the segment polarity network in Drosophila melanogaster, the cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana. We demonstrate that structure-only methods both undershoot and overshoot the number and which sets of critical variables best control the dynamics of these models, highlighting the importance of the actual system dynamics in determining control. Our analysis further shows that the logic of automata transition functions, namely how canalizing they are, plays an important role in the extent to which structure predicts dynamics.Comment: 15 pages, 6 figure

Information flow and cooperative control of vehicle formations

We consider the problem of cooperation among a collection of vehicles performing a shared task using intervehicle communication to coordinate their actions. Tools from algebraic graph theory prove useful in modeling the communication network and relating its topology to formation stability. We prove a Nyquist criterion that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability. We also propose a method for decentralized information exchange between vehicles. This approach realizes a dynamical system that supplies each vehicle with a common reference to be used for cooperative motion. We prove a separation principle that decomposes formation stability into two components: Stability of this is achieved information flow for the given graph and stability of an individual vehicle for the given controller. The information flow can thus be rendered highly robust to changes in the graph, enabling tight formation control despite limitations in intervehicle communication capability